import sys
input = sys.stdin.readline
t = int(input())
ans = []
for _ in range(t):
n, m = map(int, input().split())
a = []
if (n * m) % 2:
for i in range(n):
a0 = []
for j in range(m):
if (i + j) % 2:
a0.append("W")
else:
a0.append("B")
a.append(a0)
else:
for i in range(n):
a0 = []
for j in range(m):
if (i + j) % 2:
a0.append("B")
else:
a0.append("W")
a.append(a0)
a[0][0] = "B"
for a0 in a:
ans.append("".join(a0))
sys.stdout.writelines("\n".join(ans))#include<bits/stdc++.h>
using namespace std;
int main()
{
int t;
cin>>t;
while(t--)
{
int n,m;
cin>>n>>m;
int array[n][m];
for(int i=0; i<n; i++)
{
for(int j=0; j<m; j++)
{
if(i==0 && j==0) cout<<"W";
else cout<<"B";
}
cout<<endl;
}
}
}1384A - Common Prefixes | 371A - K-Periodic Array |
1542A - Odd Set | 1567B - MEXor Mixup |
669A - Little Artem and Presents | 691B - s-palindrome |
851A - Arpa and a research in Mexican wave | 811A - Vladik and Courtesy |
1006B - Polycarp's Practice | 1422A - Fence |
21D - Traveling Graph | 1559B - Mocha and Red and Blue |
1579C - Ticks | 268B - Buttons |
898A - Rounding | 1372B - Omkar and Last Class of Math |
1025D - Recovering BST | 439A - Devu the Singer and Churu the Joker |
1323A - Even Subset Sum Problem | 1095A - Repeating Cipher |
630F - Selection of Personnel | 630K - Indivisibility |
20B - Equation | 600B - Queries about less or equal elements |
1015A - Points in Segments | 1593B - Make it Divisible by 25 |
680C - Bear and Prime 100 | 1300A - Non-zero |
1475E - Advertising Agency | 1345B - Card Constructions |